Global matching criterion and color segmentation based stereo

نویسندگان

  • Hai Tao
  • Harpreet S. Sawhney
چکیده

In this paper, we present a new analysis by synthesis computational framework for stereo vision. It is designed to achieve the following goals: (1) enforcing global visibility constraints, (2) obtaining reliable depth for depth boundaries and thin structures, (3) obtaining correct depth for textureless regions, and (4) hypothesizing correct depth for unmatched regions. The framework employs depth and visibility based rendering within a global matching criterion to compute depth in contrast with approaches that rely on local matching measures and relaxation. A color segmentation based depth representation guarantees smoothness in textureless regions. Hypothesizing depth from neighboring segments enables propagation of correct depth and produces reasonable depth values for unmatched region. A practical algorithm that integrates all these aspects is presented in this paper. Comparative experimental results are shown for real images. Results on new view rendering based on a single stereo pair are also demonstrated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stereo Matching Using Iterative Dynamic Programming Based on Color Segmentation of Images

The traditional dynamic programming stereo matching algorithms usually adopt the disparity assumption based on the intensity change of images; With the development of stereo matching technique, the disparity assumption based on image color segmentation is proved to meet better the need of true scenes. The paper introduces the disparity assumption into the stereo matching using dynamic programmi...

متن کامل

Microsoft Word - WG2-4.DOC

In this paper, we present a new stereo matching algorithm using global and local color segmentation. After we perform a quad-tree decomposition to generate global and local color segments, we determine meaningful depth information between global and local disparities based on the disparity space distribution. Unlike the previous segment-based stereo matching methods, we consider globality and l...

متن کامل

Stereo Matching: An Outlier Confidence Approach

One of the major challenges in stereo matching is to handle partial occlusions. In this paper, we introduce the Outlier Confidence (OC) which dynamically measures how likely one pixel is occluded. Then the occlusion information is softly incorporated into our model. A global optimization is applied to robustly estimating the disparities for both the occluded and non-occluded pixels. Compared to...

متن کامل

Stereo Matching Based on Adaptive Window and Reliability Constraint ?

Focusing on the problem of stereo matching accuracy not high enough in the image matching with discontinuous or weak texture, this paper is to propose a stereo matching method which takes the advantages of the local matching and global matching. Firstly, color image segmentation is applied for mean shift algorithm. Secondly, in the local matching the multi-window adaptive algorithm is used to s...

متن کامل

An integrated approach to stereo matching, surface reconstruction and depth segmentation using consistent smoothness assumptions

This paper presents a new algorithm for stereo ma.tching which makes use of simultaneous matching. surface reconstruction, and segmentation of world surfaces. By integrating these three phases, which are traditiona.lly tempora.lly separated, the algorithm can make use of the current surface information to help disambiguate the potential matches. After discussing the required mathematical backgr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000